External Memory Sort On CGM1 Clusters
نویسندگان
چکیده
External memory sort has been widely accepted as an overall benchmark to evaluate the processing performance of computers. Lots of algorithms have been developed to sort large scalable data in different environments. The bottlenecks of external memory sort are the I/O operation and communication cost. In this paper, we adapted HPVM MinuteSort[4], and borrowed the THsort[5] idea to develop our external memory sort algorithm, which minimizes the I/O and communication costs. We hope that we will get better performance than other algorithms.
منابع مشابه
Parallel Mining Association Rules in Distributed Memory System
We consider the problem of mining association rules on the distributed memory system, CGM1 system, which has 32 nodes. Furthor more, since each node of CGM1 system consists of two processors which share the same resource in the node, we can utilize this feature to employ shared memory apriori algorithm in one node.
متن کاملA Synthesis of P rallel Out-of-core Sorting Programs on Heterogeneous Clusters
The paper considers the problem of parallel external sorting in the context of a form of heterogeneous clusters. We introduce two algorithms and we compare them to another one that we have previously developed. Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don’t fit in main memory. This is the case fo...
متن کاملExternal Memory Parallel Sorting by Sampling
This paper introduces an external memory parallel sorting algorithm in a multiprocessor architecture. The overall goal is to choose p − 1 partitioning elements so that the final p sorted files, one per processor, are of roughly equal size. It first determines a sample of splitters by either regular sampling or random sampling techniques. Then each data file at each processor is separated accord...
متن کاملAn External - Memory Data Structure for Shortest Path
In this paper, we present results related to satisfying shortest path queries on a planar graph stored in external memory. N denotes the total number of vertices and edges in the graph and sort(N) denotes the number of input/output (I/O) operations required to sort an array of length N. 1) We describe a data structure for supporting bottom-up traversal of rooted trees in external memory. A tree...
متن کاملExternal Sorting on Flash Memory Via Natural Page Run Generation
The increasing popularity of flash memory means more database systems will run on flash memory in the future. One of the most important database operations is the external sort. Hence, this paper is focused on studying the problem of efficient external sorting on flash memory. In contrast to most previous work, we target the situation where previously sorted data has become progressively un-sor...
متن کامل